Number ecologies: numbers and numbering practices
نویسندگان
چکیده
منابع مشابه
Giant number fluctuations in microbial ecologies.
Statistical fluctuations in population sizes of microbes may be quite large depending on the nature of their underlying stochastic dynamics. For example, the variance of the population size of a microbe undergoing a pure birth process with unlimited resources is proportional to the square of its mean. We refer to such large fluctuations, with the variance growing as square of the mean, as giant...
متن کاملMargulis Numbers and Number Fields
Let M be a closed, orientable hyperbolic 3-manifold such that (1) H1(M ; Zs) = 0 for s = 2, 3, 7. Suppose that (2) M is non-Haken, or more generally that it has integral traces. If the trace field of M is quadratic then 0.395 is a Margulis number for M . If the trace field is cubic then 0.3 is a Margulis number for M . If K is any number field, then for all but finitely many closed, orientable ...
متن کاملValue Numbering
Value numbering is a compiler-based program analysis method that allows redundant computations to be removed. This paper compares hash-based approaches derived from the classic local algorithm1 with partitioning approaches based on the work of Alpern, Wegman, and Zadeck2. Historically, the hash-based algorithm has been applied to single basic blocks or extended basic blocks. We have improved th...
متن کاملMinimum Clique Number, Chromatic Number, and Ramsey Numbers
Let Q(n, c) denote the minimum clique number over graphs with n vertices and chromatic number c. We investigate the asymptotics of Q(n, c) when n/c is held constant. We show that when n/c is an integer α, Q(n, c) has the same growth order as the inverse function of the Ramsey number R(α+ 1, t) (as a function of t). Furthermore, we show that if certain asymptotic properties of the Ramsey numbers...
متن کاملCarmichael Numbers in Number Rings
for all integers a. This result gives us the rudimentary Fermat Compositeness Test: If a 6≡ a (mod n) for some integer a, then n is composite. While this has the advantage of being computationally simple, it has the distinct disadvantage of failing for some composite n and choice of a. Take, for example, n = 341 = 31 · 11 and a = 2. A quick computation tells us that 2 ≡ 2 (mod 341). Fortunately...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distinktion: Journal of Social Theory
سال: 2014
ISSN: 1600-910X,2159-9149
DOI: 10.1080/1600910x.2014.923011